First-passage time statistics on surfaces of general shape: Surface PDE solvers using Generalized Moving Least Squares (GMLS)
نویسندگان
چکیده
We develop numerical methods for computing statistics of stochastic processes on surfaces general shape with drift-diffusion dynamics dXt=a(Xt)dt+b(Xt)dWt. formulate descriptions Brownian motion and surfaces. consider the form u(x)=Ex[∫0τg(Xt)dt]+Ex[f(Xτ)] a domain Ω exit stopping time τ=inft{t>0|Xt∉Ω}, where f,g are smooth functions. For these statistics, we high-order Generalized Moving Least Squares (GMLS) solvers associated surface PDE boundary-value problems based Backward-Kolmogorov equations. focus particularly mean First Passage Times (FPTs) given by case f=0,g=1 u(x)=Ex[τ]. perform studies variety shapes showing our converge accuracy both in capturing geometry solutions. then how influenced geometry, drift dynamics, spatially dependent diffusivities.
منابع مشابه
Generation of Adaptive Streak Surfaces Using Moving Least Squares
We introduce a novel method for the generation of fully adaptive streak surfaces in time-varying flow fields based on particle advection and adaptive mesh refinement. Moving least squares approximation plays an important role in multiple stages of the proposed algorithm, which adaptively refines the surface based on curvature approximation and circumradius properties of the underlying Delaunay ...
متن کاملSurfaces Generated by Moving Least Squares Methods
An analysis of moving least squares (m.l.s.) methods for smoothing and interpolating scattered data is presented. In particular, theorems are proved concerning the smoothness of interpolants and the description of m.l.s. processes as projection methods. Some properties of compositions of the m.l.s. projector, with projectors associated with finiteelement schemes, are also considered. The analys...
متن کاملMoving Least Squares Multiresolution Surface Approximation
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The output of the method is a refined triangular mesh with points on the moving least squares surface of the original point cloud.
متن کاملOn Generalized Moving Least Squares and Diffuse Derivatives
The Moving Least Squares method (MLS) provides an approximation û of a function u based solely on values u(xj) of u on scattered ”meshless” nodes xj . Derivatives of u are usually approximated by derivatives of û. In contrast to this, we directly estimate derivatives of u from the data, without any detour via derivatives of û. This is a generalized Moving Least Squares technique, and we prove t...
متن کاملGeneralized Least Squares Multiple 3d Surface Matching
A method for the simultaneous co-registration and georeferencing of multiple 3D pointclouds and associated intensity information is proposed. It is a generalization of the 3D surface matching problem. The simultaneous co-registration provides for a strict solution to the problem, as opposed to sequential pairwise registration. The problem is formulated as the Least Squares matching of overlappi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2022
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2021.110932